Energy Efficient AODV (EE-AODV) for Improving QoS Routing in Mobile Adhoc Network and Classified Normal and Suspicious traffic using NS-3 Simulator

Mobile ad hoc networks support multi hop routing where the deployment of central base station is neither economic nor easy. Efficient routing of the packets is a major challenge in the ad hoc networks. There exist several proactive (like DSDV etc.) and reactive (Like AODV etc.) routing algorithms for the dynamic networks.The EEAODV ALGORITHM selects the path with minimum cost value indicating that the path has the shortest distance to the destination and has the maximum of the minimum available battery power of the node among the different paths. This selected path is chosen as the best path for packet transmission till any node in the path exhausts battery power beyond a threshold value. At this point of time, a backup path having the next lower cost is selected as an alternate path for packet transmission. The process is repeated till all the paths from the same source to destination are exhausted with their battery power. When this situation occurs, the cost of the paths is re-calculated and the process continues. The simulation result of the proposed algorithm EEAODV ALGORITHM enhances the network life time over the AODV and EEAODV algorithm and for better refinement of result our approach is to classified suspicious and normal traffic using different filtering rules using WireShark.